Approximation Algorithms for Cellular Network Optimization
نویسنده
چکیده
We consider two optimization problems for cellular telephone networks with interferences, which address the positioning of base stations (on given locations) with the aim to maximize the number of supplied demand nodes and minimize the number of stations that have to be built. It is known that in general, these problems are NP-complete and even hard to approximate. Here we show that the Euclidean versions of all problems allow a polynomial time approximation scheme (PTAS). Furthermore, we consider some optimization problems without interferences in the Euclidean plane, addressing the problems to nd rst a minimum number of base stations locations and second to select a minimum set of given base station locations.
منابع مشابه
Approximation Solutions for Time-Varying Shortest Path Problem
Abstract. Time-varying network optimization problems have tradition-ally been solved by specialized algorithms. These algorithms have NP-complement time complexity. This paper considers the time-varying short-est path problem, in which can be optimally solved in O(T(m + n)) time,where T is a given integer. For this problem with arbitrary waiting times,we propose an approximation algorithm, whic...
متن کاملJoint Allocation of Computational and Communication Resources to Improve Energy Efficiency in Cellular Networks
Mobile cloud computing (MCC) is a new technology that has been developed to overcome the restrictions of smart mobile devices (e.g. battery, processing power, storage capacity, etc.) to send a part of the program (with complex computing) to the cloud server (CS). In this paper, we study a multi-cell with multi-input and multi-output (MIMO) system in which the cell-interior users request service...
متن کاملMulti-objective Grasshopper Optimization Algorithm based Reconfiguration of Distribution Networks
Network reconfiguration is a nonlinear optimization procedure which calculates a radial structure to optimize the power losses and improve the network reliability index while meeting practical constraints. In this paper, a multi-objective framework is proposed for optimal network reconfiguration with the objective functions of minimization of power losses and improvement of reliability index. T...
متن کاملDistributed Bregman-Distance Algorithms for Min-Max Optimization
We consider a min-max optimization problem over a time-varying network of computational agents, where each agent in the network has its local convex cost function which is a private knowledge of the agent. The agents want to jointly minimize the maximum cost incurred by any agent in the network, while maintaining the privacy of their objective functions. To solve the problem, we consider subgra...
متن کاملVerification of an Evolutionary-based Wavelet Neural Network Model for Nonlinear Function Approximation
Nonlinear function approximation is one of the most important tasks in system analysis and identification. Several models have been presented to achieve an accurate approximation on nonlinear mathematics functions. However, the majority of the models are specific to certain problems and systems. In this paper, an evolutionary-based wavelet neural network model is proposed for structure definiti...
متن کاملVMLP neural network design using optimization algorithms to predict spider suspend (Case Study: Watershed Dam Kardeh)
One of the most important processes of erosion and sediment transport in streams is the river most complex engineering issues.this process special effects on water quality indices, action suburbs floor and destroyed much damage to the river and also into the development plans Lack of continuity sediment sampling and measurement of many existing stations. due to the low number of hydrometric s...
متن کامل